Strongly Secure Quantum Ramp Secret Sharing Constructed from Algebraic Curves over Finite Fields
نویسنده
چکیده
The first construction of strongly secure quantum ramp secret sharing by Zhang and Matsumoto had an undesirable feature that the dimension of quantum shares must be larger than the number of shares. By using algebraic curves over finite fields, we propose a new construction in which the number of shares can become arbitrarily large for fixed dimension of shares.
منابع مشابه
Strongly Secure Quantum Ramp Secret Sharing Constructed from Algebraic Curves over Finite Fields (full version arXiv:1410.5126)
Secret sharing (SS) scheme encodes a secret into multiple shares being distributed to participants, so that only qualified sets of shares can reconstruct the secret perfectly [13]. The secret and shares are traditionally classical information [13], but now quantum secret and quantum shares can also be used [3, 4, 11]. In perfect SS, if a set of shares is not qualified, that is, it cannot recons...
متن کاملStrongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves
In this work we introduce a novel paradigm for the construction of ramp schemes with strong multiplication that allows the secret to be chosen in an extension field, whereas the shares lie in a base field. When applied to the setting of Shamir’s scheme, for example, this leads to a ramp scheme with strong multiplication from which protocols can be constructed for atomic secure multiplication wi...
متن کاملStrong Security of the Strongly Multiplicative Ramp Secret Sharing Based on Algebraic Curves
Secret sharing [1] is a well-established topic in the information security [2]. It attracts renewed interest after Cramer et al. [3] revealed that any linear secret sharing with the so-called multiplicative (or strongly multiplicative) property can be used for the secure multiparty computation. Later, the multiplicative properties were generalized to the ramp secret sharing [4], [5]. In [5, Sec...
متن کاملLinear Secret Sharing from Algebraic-Geometric Codes
It is well-known that the linear secret-sharing scheme (LSSS) can be constructed from linear error-correcting codes (Brickell [1], R.J. McEliece and D.V.Sarwate [2],Cramer, el.,[3]). The theory of linear codes from algebraic-geometric curves (algebraic-geometric (AG) codes or geometric Goppa code) has been well-developed since the work of V.Goppa and Tsfasman, Vladut, and Zink( see [17], [18] a...
متن کاملAn Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1410.5126 شماره
صفحات -
تاریخ انتشار 2014